Inferring Attribute Grammars with Structured Data for Natural Language Processing
نویسنده
چکیده
This paper presents a method for inferring reversible attribute grammars from tagged natural language sentences. Attribute grammars are a form of augmented context free grammar that assign "meaning" in the form of a data structure to a string in a context free language. The method presented in this paper has the ability to infer attribute grammars that can generate a wide range of useful data structures such as simple and structured types, lists, concatenated strings, and natural numbers. The method also presents two new forms of grammar generalisation; generalisation based upon identification of optional phrases and generalisation based upon lists. The method has been applied to and tested on the task of the rapid development of spoken dialog systems.
منابع مشابه
A Polynomial Time Algorithm for Inferring Grammars for Mildly Context Sensitive Languages
Natural languages are largely context-sensitive, yet context-sensitive grammars cannot be identified in the limit from positive examples [Gold, 1967]. Mildly context-sensitive languages are able to express the most common context-sensitive structures found in natural language. We restrict our view to a class of mildly context-sensitive languages which can be described by simple external context...
متن کاملFrom Attribute Grammars to Constraint Handling Rules
Attribute grammars provide a framework to define computations over trees, by decorating those trees with attributes. Attribute grammars have been successfully applied in many areas, including compiler construction and natural language processing. In this paper we present a translation of attribute grammars to Constraint Handling Rules, a formalism based on constraint rewriting. Our translation ...
متن کاملAGile, a structured editor, analyzer, metric evaluator, and transformer for Attribute Grammars
As edit, analyze, measure or transform attribute grammars by hand is an exhaustive task, it would be great if it could be automatized, specially for those who work in Language Engineering. However, currently there are no editors oriented to grammar development that cover all our needs. In this paper we describe the architecture and the development stages of AGile, a structured editor, analyzer,...
متن کاملInferring Grammars for Mildly Context Sensitive Languages in Polynomial-Time
Natural languages contain regular, context-free, and contextsensitive syntactic constructions, yet none of these classes of formal languages can be identified in the limit from positive examples. Mildly context-sensitive languages are able to represent some context-sensitive constructions, those most common in natural languages, such as multiple agreement, crossed agreement, and duplication. Th...
متن کاملSyntactic Processing of Diagrams by Graph Grammars
We deal with syntactic definitions and processing of program diagrams based on graph grammars with respect to the mechanical drawing. We propose an attribute NCE graph grammar of hierarchical diagrams such as structured program diagrams. We also propose attribute context-free and context-sensitive NCE graph grammars for nested and tessellation diagrams, respectively. Attribute rules are used fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002